Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a) → b
f(c) → d
f(g(x, y)) → g(f(x), f(y))
f(h(x, y)) → g(h(y, f(x)), h(x, f(y)))
g(x, x) → h(e, x)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a) → b
f(c) → d
f(g(x, y)) → g(f(x), f(y))
f(h(x, y)) → g(h(y, f(x)), h(x, f(y)))
g(x, x) → h(e, x)
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Precedence:
f1 > b
f1 > d
f1 > g2 > h2
f1 > g2 > e
Status:
d: multiset
e: multiset
b: multiset
g2: multiset
a: multiset
c: multiset
f1: multiset
h2: multiset